Social Relation Reasoning Based on Triangular Constraints
نویسندگان
چکیده
Social networks are essentially in a graph structure where persons act as nodes and the edges connecting denote social relations. The prediction of relations, therefore, relies on context graphs to model higher-order constraints among which has not been exploited sufficiently by previous works, however. In this paper, we formulate paradigm relations into triangular relational closed-loop structures, i.e., constraints, further introduce reasoning attention network (TRGAT). Our TRGAT employs mechanism aggregate features with graph, thereby exploiting reason iteratively. Besides, acquire better feature representations persons, node contrastive learning relation reasoning. Experimental results show that our method outperforms existing approaches significantly, higher accuracy consistency generating graphs.
منابع مشابه
Temporal Relation Classification Based on Temporal Reasoning
The area of temporal information extraction has recently focused on temporal relation classification. This task is about classifying the temporal relation (precedence, overlap, etc.) holding between two given entities (events, dates or times) mentioned in a text. This interest has largely been driven by the two recent TempEval competitions. Even though logical constraints on the structure of po...
متن کاملRanking triangular interval-valued fuzzy numbers based on the relative preference relation
In this paper, we first use a fuzzy preference relation with a membership function representing preference degree forcomparing two interval-valued fuzzy numbers and then utilize a relative preference relation improved from the fuzzypreference relation to rank a set of interval-valued fuzzy numbers. Since the fuzzy preference relation is a total orderingrelation that satisfies reciprocal and tra...
متن کاملConstraints Based Taxonomic Relation Classification
Determining whether two terms in text have an ancestor relation (e.g. Toyota and car) or a sibling relation (e.g. Toyota and Honda) is an essential component of textual inference in NLP applications such as Question Answering, Summarization, and Recognizing Textual Entailment. Significant work has been done on developing stationary knowledge sources that could potentially support these tasks, b...
متن کاملReasoning on Constraints in Constraint
Constraint Logic Programming solvers on nite domains use constraints to prune those combinations of assignments which cannot appear in any consistent solution. There are applications, such as temporal reasoning or scheduling, requiring some form of qualitative reasoning where constraints can be changed (restricted) during the computation or even chosen when disjunc-tion occurs. We embed in a CL...
متن کاملPossibilistic Temporal Reasoning based on Fuzzy Temporal Constraints
In this paper we propose a propositional temporal language based on fuzzy temporal constraints which turns out to be expressive enough for domains –like many coming from medicine– where knowledge is of propositional nature and an explicit handling of time, imprecision and uncertainty are required. The language is provided with a natural possibilistic semantics to account for the uncertainty iss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i1.25151